Перевод: с английского на русский

с русского на английский

asymptotic triangle

См. также в других словарях:

  • Ideal triangle — In hyperbolic geometry an ideal triangle is a hyperbolic triangle whose three vertices all lie on the circle at infinity. In the Poincaré disk model an ideal triangle is bounded by three circles which intersect the boundary circle at right angles …   Wikipedia

  • Hyperbolic geometry — Lines through a given point P and asymptotic to line R. A triangle immersed in a saddle shape plane (a hyperbolic paraboloid), as well as two diverging ultraparall …   Wikipedia

  • Binomial coefficient — The binomial coefficients can be arranged to form Pascal s triangle. In mathematics, binomial coefficients are a family of positive integers that occur as coefficients in the binomial theorem. They are indexed by two nonnegative integers; the… …   Wikipedia

  • Fibonacci number — A tiling with squares whose sides are successive Fibonacci numbers in length …   Wikipedia

  • Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… …   Wikipedia

  • Bell number — In combinatorial mathematics, the n th Bell number, named in honor of Eric Temple Bell, is the number of partitions of a set with n members, or equivalently, the number of equivalence relations on it. Starting with B 0 = B 1 = 1, the first few… …   Wikipedia

  • Systolic geometry — In mathematics, systolic geometry is the study of systolic invariants of manifolds and polyhedra, as initially conceived by Charles Loewner, and developed by Mikhail Gromov and others, in its arithmetic, ergodic, and topological manifestations.… …   Wikipedia

  • Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …   Wikipedia

  • List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

  • Ultralimit — For the direct limit of a sequence of ultrapowers, see Ultraproduct. In mathematics, an ultralimit is a geometric construction that assigns to a sequence of metric spaces Xn a limiting metric space. The notion of an ultralimit captures the… …   Wikipedia

  • Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»